Partial combinatory algebra and generalized numberings
نویسندگان
چکیده
Generalized numberings are an extension of Ershov's notion numbering, based on partial combinatory algebra (pca) instead the natural numbers. We study various algebraic properties generalized numberings, relating numbering to pca. As in lambda calculus, extensionality is a key here.
منابع مشابه
Partial Numberings and Precompleteness
Precompleteness is a powerful property of numberings. Most numberings commonly used in computability theory such as the Gödel numberings of the partial computable functions are precomplete. As is well known, exactly the precomplete numberings have the effective fixed point property. In this paper extensions of precompleteness to partial numberings are discussed. As is shown, most of the importa...
متن کاملAn Isomorphism Theorem for Partial Numberings
As is well-known, two equivalent total numberings are computably isomorphic, if at least one of them is precomplete. Selivanov asked whether a result of this type is true also for partial numberings. As has been shown by the author, numberings of this kind appear by necessity in studies of effectively given topological spaces like the computable real numbers. In the present paper it is demonstr...
متن کاملA note on partial numberings
The different behaviour of total and partial numberings with respect to the reducibility preorder is investigated. Partial numberings appear quite naturally in computability studies for topological spaces. The degrees of partial numberings form a distributive lattice which in the case of an infinite numbered set is neither complete nor contains a least element. Friedberg numberings are no longe...
متن کاملStrong reducibility of partial numberings
A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numbering to be reduced into corresponding indices of the other numbering. The degrees of partial numberings of a given set with respect to this relation form an upper semilattice. In addition, Ershov’s completion constructio...
متن کاملCollapsing Partial Combinatory Algebras
Partial combinatory algebras occur regularly in the literature as a framework for an abstract formulation of computation theory or re-cursion theory. In this paper we develop some general theory concerning homomorphic images (or collapses) of pca's, obtained by identiication of elements in a pca. We establish several facts concerning nal collapses (maximal identiication of elements). `En passan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2022
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2022.04.054